The Gopala-Hemachandra universal code determined by straight lines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variations on the Fibonacci Universal Code

This note presents variations on the Fibonacci universal code, that may also be called the Gopala-Hemachandra code, that can have applications in source coding as well as in cryptography.

متن کامل

Proposing a new code by considering pieces of discrete straight lines in contour shapes

Pattern substrings analysis to find high redundancy in binary shapes is carried out to improve compression levels in binary objects. Modifications of a recent set of symbols to encode arbitrary contour shapes is proposed. The concept of Pieces of Discrete Straight Lines is introduced and the probability of appearance of symbols in contours is analyzed to propose a code of nine symbols, MDF9. Al...

متن کامل

Cutting Disjoint Disks by Straight Lines

For k > 0 let f(k) denote the minimum integerf such that, for any family of k pairwise disjoint congruent disks in the plane, there is a direction t~ such that any line having direction ~ intersects at mostf of the disks. We determine the exact asymptotic behavior off(k) by proving that there are two positive constants dt, d 2 such that dlx/k.,/~gk~f(k)~d:,x/k~,/~gk. This result has been motiva...

متن کامل

Extracting straight lines by sequential fuzzy clustering

In clustering line segments into a straight line, threshold-based methods such as hierarchical clustering are often used. The line segments comprising a straight line often get misaligned due to noise. Thresholdbased methods have di culty clustering such line segments. A new cluster extraction method is proposed to cope with this problem. This method extracts fuzzy clusters one by one using mat...

متن کامل

Drawing Straight Lines

lines, pseudolines, polar coordinates, trilinear coordinates, non-linear programming, geometry We present a graph-drawing algorithm which respects extended co-linearity constraints. These are expressed as a set of ‘straight’ paths in a planar graph. Constraints of this sort are translated into a set of inequalities over polar coordinates of lines. These inequalities provide necessary and suffic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematics and Computer Science

سال: 2019

ISSN: 2008-949X

DOI: 10.22436/jmcs.019.03.03